On the classification of linear complementary dual codes

نویسندگان

  • Makoto Araya
  • Masaaki Harada
چکیده

We give a complete classification of binary linear complementary dual codes of lengths up to 13 and ternary linear complementary dual codes of lengths up to 10.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary linear complementary dual codes

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...

متن کامل

Linear codes with complementary duals related to the complement of the Higman-Sims graph

‎In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7‎, ‎11$ defined by the 3‎- ‎7‎- ‎and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100‎. ‎With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...

متن کامل

Complementary Dual Subfield Linear Codes Over Finite Fields

Two families of complementary codes over finite fields q are studied, where 2 = q r is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and sufficient conditions for a linear code (resp., a subfield linear code) to be Hermitian complementary dual (resp., trace Hermitian complementary dual) are determined. Construct...

متن کامل

Matrix-Product Complementary dual Codes

Linear complementary dual codes (LCD) are linear codes satisfying C ∩C = {0}. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal matrices. Some asymptotic results are derived.

متن کامل

The classification of complementary information set codes of lengths 14 and 16

In the paper " A new class of codes for Boolean masking of cryptographic computations , " Carlet, Gaborit, Kim, and Solé defined a new class of rate one-half binary codes called complementary information set (or CIS) codes. The authors then classified all CIS codes of length less than or equal to 12. CIS codes have relations to classical Coding Theory as they are a generalization of self-dual c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018